package merge_sort;

public class InversePairs {
    public int InversePairs (int[] nums) {
        // write code here
        long ret = 0;
        for(int i =0;i < nums.length;i++) {
            for(int j = i+1;j < nums.length;j++) {
                if(nums[i] > nums[j]) {
                    ret++;
                }
            }

        }
        return (int)(ret % 1000000007);
    }
}
